On the complexity of propositional logics with an involutive negation
نویسنده
چکیده
Let C be the propositional calculus given by a standard SBL-algebra; C is obtained from C by adding an involutive negation, with axioms and deduction rules as in [4]. Then C is coNP-complete.
منابع مشابه
T-norm-based logics with an independent involutive negation
In this paper we investigate the addition of arbitrary independent involutive negations to t-norm based logics. We deal with several extensions of MTL and establish general completeness results. Indeed, we will show that, given any t-norm based logic satisfying some basic properties, its extension by means of an involutive negation preserves algebraic and (finite) strong standard completeness. ...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملDistinguishing standard SBL-algebras with involutive negations by propositional formulas
Propositional fuzzy logics given by a combination of a continuous SBL t-norm with finitely many idempotents and of an involutive negation are investigated. A characterization of continuous t-norms which, in combination with different involutive negations, yield either isomorphic algebras or algebras with distinct and incomparable sets of propositional tautologies is presented.
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملResiduated fuzzy logics with an involutive negation
Residuated fuzzy logic calculi are related to continuous t-norms, which are used as truth functions for conjunction, and their residua as truth functions for implication. In these logics, a negation is also definable from the implication and the truth constant 0, namely ¬φ isφ → 0. However, this negation behaves quite differently depending on the t-norm. For a nilpotent t-norm (a t-norm which i...
متن کامل